Time complexity of iterative-deepening-A∗
نویسندگان
چکیده
منابع مشابه
Time Complexity of Iterative-Deepening A*: The Informativeness Pathology
Korf et al. (2001) developed a formula, KRE, to predict the number of nodes expanded by IDA* for consistent heuristics. They proved that the predictions were exact asymptotically (in the limit of large d), and experimentally showed that they were extremely accurate even at depths of practical interest. Zahavi et al. (2010) generalized KRE to work with inconsistent heuristics and to account for ...
متن کاملTime Complexity of Iterative-Deepening A*: The Informativeness Pathology (Abstract)
Korf et al. (2001) developed a formula, KRE, to predict the number of nodes expanded by IDA* for consistent heuristics. They proved that the predictions were exact asymptotically (in the limit of large d), and experimentally showed that they were extremely accurate even at depths of practical interest. Zahavi et al. (2010) generalized KRE to work with inconsistent heuristics and to account for ...
متن کاملIterative Deepening Multiobjective A
Many real-world optimization problems involve multiple objectives which are often conflicting. When conventional heuristic search algorithms such as A* and IDA* are used for solving such problems, then these problems have to be modeled as simple cost minimization or maximization problems. The task of modeling such problems using a single valued criterion has often proved difficult [6]. The prob...
متن کاملEnhanced Iterative-Deepening Search
|Iterative-deepening searchesmimic a breadthrst node expansion with a series of depthrst searches that operate with successively extended search horizons. They have been proposed as a simple way to reduce the space complexity of bestrst searches like A* from exponential to linear in the search depth. But there is more to iterative-deepening than just a reduction of storage space. As we show, th...
متن کاملIterative Deepening Dynamic Time Warping for Time Series
Time series are a ubiquitous form of data occurring in virtually every scientific discipline and business application. There has been much recent work on adapting data mining algorithms to time series databases. For example, Das et al. attempt to show how association rules can be learned from time series [7]. Debregeas and Hebrail [8] demonstrate a technique for scaling up time series clusterin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2001
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(01)00094-7